Scheduling in theCo - Synthesis of Reactive Real - Time Systems
نویسندگان
چکیده
{ Existing software scheduling techniques limit the functions that can be implemented in software to those with a restricted class of timing constraints, in particular those with a coarse-grained, uniform, periodic behavior. In practice, however , many systems change their I/O behavior in response to the inputs from the environment. This paper considers one such class of systems, called reactive real-time systems, where timing requirements can include sequencing, rate, and response time constraints. We present a static, non-preemptive, ne-grained software scheduling algorithm to meet these constraints. This algorithm is suitable for control-dominated embedded systems with hard real-time constraints, and is part of the core of a hardware/software co-synthesis system. An embedded system is a special purpose computer consisting of one or more controllers and peripheral devices. A reactive system is an embedded system that changes its I/O behavior in response to inputs from the environment. This is in contrast to those systems with a uniform periodic behavior that is independent of their input. Many reactive systems must also meet hard timing constraints of various types imposed by the devices' protocols or by the required system behavior. These systems are referred to as reactive real-time systems. Esterel 1] and StateCharts 4] have been used for specifying reactive systems. Reactive behavior can be succinctly and conveniently captured with parallelism and watchdogs. A watchdog is a wait-on-signal statement that encloses a statement block, and breaks control ow out of the block upon receiving the signal. Both Es-terel and StateCharts assume an idealized timing model, where simple computations are assumed to take zero time to perform. However, lengthy computations that violate this assumption are extracted and treated as external signals , and timing constraints cannot be speciied on them for scheduling. While this assumption simpliies semantics , it also restricts the class of applications that can be speciied. The watchdog-concurrency reactive programming model has been augmented with timing constraints in 2]. The system behavior is divided into a number of modes. A mode speciies a scope within which a set of timing constraints must be met, until one of the watchdogs detects an event and disables, or causes a transition out of, the mode. When such a transition is initiated, each concurrent branch to be disabled is scheduled to run until a safe exit point is reached. This enables interleaving while maintaining the integrity of I/O protocols and program state. A timing constraint speciies …
منابع مشابه
Safety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملOptimal Scheduling of CHP-based Microgrid Under Real-Time Demand Response Program
Microgrid (MG) is considered as a feasible solution to integrate the distributed energy sources. In this paper, optimal scheduling of a grid-connected MG is investigated considering different power sources as combined heat and power (CHP) units, only power and heat generating units, and battery storage systems. Two different feasible operating regions are considered for the CHP units. In additi...
متن کاملScheduling Issues in the Co-Synthesis of Reactive Real-Time Systems
Many embedded control applications must respect intricate timing requirements on their interactions with the external environment. These constraints are derived from response time, rate of execution, and low-level signaling requirements. Currently, most of these systems are being designed in an ad hoc manner. Many tools assume the designer has already nalized the scheduling, while most schedule...
متن کاملReal-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm
The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...
متن کاملSimultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts
Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994